Systematic Versus Stochastic Constraint Satisfaction
نویسندگان
چکیده
This panel explores issues of systematic and stochastic control in the context of constraint satisfaction.
منابع مشابه
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld problems in planning, scheduling, and circuit diagnosis and synthesis. Our results show that incorporating CSP lookback techniques -especially the relatively new technique of relevance-bounded learning -renders easy many ...
متن کاملExploiting Variable Dependency in Local Search
Stochastic search has recently been shown to be successful for solving large boolean satissability problems. However, systematic methods tend to be more eeective in problem domains with a large number of dependent variables: that is, variables whose truth values are directly determined by a smaller set of independent variables. In systematic search, truth values can be ee-ciently propagated fro...
متن کاملStochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and sto...
متن کاملUsing Stochastic Solvers in Constraint Logic Programming
This paper proposes a general framework for integrating a constraint logic programming system with a stochastic constraint solver to solve constraint satisfaction problems eeciently. Stochastic solvers can solve hard constraint satisfaction problems very eeciently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraints. Hen...
متن کاملThe Ability of Learning Automata in Solving Constraint Satisfaction Problems
In this paper we have investigated the performance of some stochastic methods for solving constraint satisfaction (CSP) and fuzzy constraint satisfaction problems (FCSP). The purpose of this paper is to study the abilities of learning automaton in solving these problems and comparing it with other stochastic methods. The results confirm those of [2] and show its superiority to other methods.
متن کامل